Program Schemes with Pushdown Stores
نویسندگان
چکیده
منابع مشابه
Pushdown Stores and Subscripts
V a ~ r i o u s d e v i c e s f o r t h e imp r o v e m e n t o f p h r a s e s t r u c t u r e g r a m m a r s (PSG) h a v e b e e n s u g g e s t e d r e c e n t l y . I n p a r t i c u l a r , t h e PSG m o d e l w i t h a p u s h d o w n s t o r e ( P S G / P D S ) a s d e s c r i b e d b y V o Y n g v e , a n d t h e PSG w i t h s u b s c r i p t s ( P S G / S ) a s d e s c r i b e d b y G...
متن کاملHigher type recursive program schemes and the nested pushdown automaton
When implementing recursive programs on a standard von Neumann random access machine (RAM) it is natural and well known how to use a pushdown store in order to keep track of the recursive procedure calls when the program runs. The more abstract world of program schemes abounds with examples of this pushdown – recursion relation. As a concrete example it is well known how to implement monadic re...
متن کاملProgram Analysis Using Weighted Pushdown Systems
Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each configuration 〈p, S〉 in the state space consists of a (formal) “control location” p coupled with a stack S of unbounded size. PDSs can model program paths that have matching calls and returns, and automaton-based representations allo...
متن کاملRecursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
Higher-order recursive schemes offer an interesting method of approximating program semantics. The semantics of a scheme is an infinite tree labeled with built-in constants. This tree represents the meaning of the program up to the meaning of built-in constants. It is much easier to reason about properties of such trees than properties of interpreted programs. Moreover some interesting properti...
متن کاملRecursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
This paper is about two models of computation that underpin recent developments in the algorithmic verification of higher-order computation. Recursion schemes are in essence the simply-typed lambda calculus with recursion, generated from first-order symbols. Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks — which are iterations of stack of stacks —...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1972
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0201017